Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
نویسندگان
چکیده
منابع مشابه
APPROXIMATION ALGORITHMS AND HEURISTICS FOR A 2-DEPOT, HETEROGENOUS HAMILTONIAN PATH PROBLEM A Thesis by RIDDHI
Approximation Algorithms and Heuristics for a 2-Depot, Heterogenous Hamiltonian Path Problem. (August 2010) Riddhi Rajeev Doshi, B.E., North Gujarat University, Patan, India Chair of Advisory Committee: Dr. Sivakumar Rathinam Various civil and military applications of UAVs, or ground robots, require a set of vehicles to monitor a group of targets. Routing problems naturally arise in this settin...
متن کاملAlgorithm for a Generalized, Multiple Depot Hamiltonian Path Problem
We consider a Generalized, Multiple Depot Hamiltonian Path Problem (GMDHPP) and show that it has an algorithm with an approximation ratio of 32 if the costs are symmetric and satisfy the triangle inequality. This improves on the 2-approximation algorithm already available for the same.
متن کاملApproximation Algorithms and Heuristics for the Dynamic Storage Allocation Problem
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is known as the dynamic storage allocation problem (DSA) and it is known to be NP-complete. We develop some simple, polynomial-time approximation algorithms with the best of them achieving a bound of 4 for a subclass of DSA instances. We report on an extensive experimental study on the FirstFit heur...
متن کاملApproximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs;t if the two endpoints are specified, HPPs if only one endpoint is specified. We show that HPPs;t is 1 2 -differential approximable and HPPs is 2 3 -differential approximable. Moreover, we observe that these problems cannot be differential approximable better than 741 742 . Based upon these result...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robust and Nonlinear Control
سال: 2011
ISSN: 1049-8923
DOI: 10.1002/rnc.1701